path delay

path delay
задержка распространения [сигнала]; задержка прохождения сигнала [по цепи, линии и др.]
например, задержка распространения сигнала для модуля может определяться как время от момента поступления сигнала на вход до момента появления этого сигнала на выходе модуля
см. тж. CPD, path-delay test

Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. . 1998-2007.

Игры ⚽ Нужен реферат?

Смотреть что такое "path delay" в других словарях:

  • Delay box — is a common slang term used in drag racing to describe an on board timer which is a Transmission Brake Delay Timer. A transbrake forces the race car to remain stationary at the starting line, in gear, regardless of how much engine power is… …   Wikipedia

  • Delay-locked loop — In electronics, a delay locked loop (DLL) is a digital circuit similar to a phase locked loop (PLL), with the main difference being the absence of an internal voltage controlled oscillator. A DLL can be used to change the phase of a clock signal… …   Wikipedia

  • Delay line memory — Computer memory types Volatile RAM DRAM (e.g., DDR SDRAM) SRAM In development T RAM Z RAM TTRAM Historical Delay line memory Selectron tube Williams tube …   Wikipedia

  • Delay line interferometer — A delay line interferometer (DLI) can be a Mach Zehnder interferometer or Michelson interferometer based on two beam interference, in which one beam is time delayed to the other by a desired interval. Delay line interferometers are also known as… …   Wikipedia

  • delay line — /dəˈleɪ laɪn/ (say duh lay luyn) noun Electronics a device which introduces a delay into a signal path …  

  • Routing in delay tolerant networking — concerns itself with theability to transport, or route, data from a source to adestination is a fundamental ability all communication networks musthave. Delay and disruption tolerant networks(DTNs), arecharacterized by their lack of connectivity …   Wikipedia

  • Shortest path problem — A graph with 6 vertices and 7 edges In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is… …   Wikipedia

  • Critical path method — PERT chart for a project with five milestones (10 through 50) and six activities (A through F). The project has two critical paths: activities B and C, or A, D, and F – giving a minimum project time of 7 months with fast tracking. Activity E is… …   Wikipedia

  • B. H. DeLay — Infobox Actor name = B. H. De Lay imagesize = 300px caption = Aviator Actor B. H. De Lay birthdate = birth date|1891|8|12|mf=y location = flagicon|USA San Francisco Bay Area, CA, U.S. height = deathdate = death date and… …   Wikipedia

  • Somerville Community Path — The Somerville Community Path is a project to build a mixed use path in Somerville, Massachusetts, from the Cambridge border near Davis Square to the Cambridge border near Lechmere Square. Roughly 0.8 miles (1.3 km) of the path is finished and in …   Wikipedia

  • Constrained Shortest Path First — (CSPF) is an extension of shortest path algorithms. The path computed using CSPF is a shortest path fulfilling a set of constraints. It simply means that it runs shortest path algorithm after pruning those links that violate a given set of… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»